Lexicalised Configuration Grammars
نویسندگان
چکیده
This paper introduces Lexicalised Configuration Grammars (lcgs), a new declarative framework for natural language syntax. lcg is powerful enough to encode a large number of existing grammar formalisms, facilitating their comparison from the perspective of graph configuration. Once a formalism has been encoded as an lcg, the framework offers various means to increase its expressivity in a controlled manner; trading expressive power for computational complexity, this makes it possible to model syntactic phenomena in novel ways. Parsing algorithms for lcgs lend themselves to a combination of chart-based and constraint-based processing techniques, allowing both to bring in their strengths.
منابع مشابه
Towards Domain-Independent Deep Linguistic Processing: Ensuring Portability and Re-Usability of Lexicalised Grammars
In this paper we illustrate and underline the importance of making detailed linguistic information a central part of the process of automatic acquisition of large-scale lexicons as a means for enhancing robustness and at the same time ensuring maintainability and re-usability of deep lexicalised grammars. Using the error mining techniques proposed in (van Noord, 2004) we show very convincingly ...
متن کاملEnabling Adaptation of Lexicalised Grammars to New Domains
This extended abstract focuses on the main points we will be touching upon during our talk, the aim of which is to present in a concise manner our group’s work on enhancing robustness of lexicalised grammars for real-life applications and thus also on enabling their adaptation to new domains in its entirety.
متن کاملStochastic Categorial Grammars
Statistical methods have turned out to be quite successful in natural language processing. During the recent years, several models of stochastic grammars have been proposed, including models based on lexicalised context-free grammars [3], tree adjoining grammars [15], or dependency grammars [2, 5]. In this exploratory paper, we propose a new model of stochastic grammar, whose originality derive...
متن کاملITRI-02-14 Learning Grammars for Noun Phrase Extraction by Partition Search
This paper describes an application of Grammar Learning by Partition Search to noun phrase extraction, an essential task in information extraction and many other NLP applications. Grammar Learning by Partition Search is a general method for automatically constructing grammars for a range of parsing tasks; it constructs an optimised probabilistic context-free grammar by searching a space of nont...
متن کاملLearning Grammars for Noun Phrase Extraction by Partition Search
This paper describes an application of Grammar Learning by Partition Search to noun phrase extraction, an essential task in information extraction and many other NLP applications. Grammar Learning by Partition Search is a general method for automatically constructing grammars for a range of parsing tasks; it constructs an optimised probabilistic context-free grammar by searching a space of nont...
متن کامل